Building Ensembles of Surrogates by Optimal Convex Combination

نویسندگان

  • Martina Friese
  • Thomas Bartz-Beielstein
  • Michael Emmerich
چکیده

When using machine learning techniques for learning a function approximation from given data it can be difficult to select the right modelling technique. Without preliminary knowledge about the function it might be beneficial if the algorithm could learn all models by itself and select the model that suits best to the problem, an approach known as automated model selection. We propose a generalization of this approach that also allows to combine the predictions of several surrogate models into one more accurate ensemble surrogate model. This approach is studied in a fundamental way, by first evaluating minimalistic ensembles of only two surrogate models in detail and then proceeding to ensembles with more surrogate models. The results show to what extent combinations of models can perform better than single surrogate models and provide insights into the scalability and robustness of the approach. The focus is on multi-modal functions which are important in surrogate-assisted global optimization.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Mixed-integer Convex Formulation for Production Optimization of Gas- Lifted Oil Fields with Routing and Pressure Constraints

Production optimization of gas-lifted oil fields under facility, routing, and pressure constraints has attracted the attention of researchers and practitioners for its scientific challenges and economic impact. The available methods fall into one of two categories: nonlinear or piecewise-linear approaches. The nonlinear methods optimize simulation models directly or use surrogates obtained by c...

متن کامل

Weights in block iterative methods

In this paper we introduce a sequential block iterative method and its simultaneous version with op-timal combination of weights (instead of convex combination) for solving convex feasibility problems.When the intersection of the given family of convex sets is nonempty, it is shown that any sequencegenerated by the given algorithms converges to a feasible point. Additionally for linear feasibil...

متن کامل

A numerical approach for optimal control model of the convex semi-infinite programming

In this paper, convex semi-infinite programming is converted to an optimal control model of neural networks and the optimal control model is solved by iterative dynamic programming method. In final, numerical examples are provided for illustration of the purposed method.

متن کامل

Study of Optimal Area of Atrium for Daylight Utilization (Case Study: Administrative Building in Qazvin, Iran)

Atrium is a popular architectural feature utilized widely by building designers and owners to bring various benefits such as adequate daylight, circulation spaces and surfaces for landscape applications. But atrium problems in tropical climates such as excessive daylight, glare and high temperature, which lead to increase building energy demand, have been reported. Atrium has been used with var...

متن کامل

Binary Excess Risk for Smooth Convex Surrogates

In statistical learning theory, convex surrogates of the 0-1 loss are highly preferred because of the computational and theoretical virtues that convexity brings in. This is of more importance if we consider smooth surrogates as witnessed by the fact that the smoothness is further beneficial both computationallyby attaining an optimal convergence rate for optimization, and in a statistical sens...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016